An Optimized Neural Network Prediction Model for Reservoir Porosity Based on Improved Shuffled Frog Leaping Algorithm

نویسندگان

چکیده

Abstract Efficient and accurate porosity prediction is essential for the fine description of reservoirs, which an optimized BP neural network (BPNN) model proposed. Aiming at problem that BPNN sensitive to initialization converges local optimum easily, improved shuffled frog leaping algorithm (ISFLA) proposed based on roulette genetic coding. Firstly, a mechanism introduced improve selection probability elite individuals, thus enhancing global optimization ability. Secondly, coding method carried out by making full use effective information such as optimal solutions boundary values subgroups. Subsequently, ISFLA verified 12 benchmark functions compared with four intelligent algorithms, experimental results show its good performance. Finally, applied initial weights thresholds BPNN, new named ISFLA_BP study problem. The logging data preprocessed grey correlation analysis deviation normalization, then achieved natural gamma, density other relevant parameters. performance standard three-layer parameter methods swarm intelligence algorithms. Experimental has higher training accuracy, stability faster convergence speed, mean square error 0.02, accuracy than five methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Shuffled Frog Leaping Algorithm ⋆

In order to overcome the defects of Shuffled Frog Leaping Algorithm (SFLA) such as nonuniform initial population, slow searching speed in the late evolution and easily trapping into local extremum, a new Shuffled Frog Leaping Algorithm based on mutation operator and population diversity is proposed in this paper. The algorithm has overcome the disadvantage mentioned above. The algorithm efficie...

متن کامل

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

Shuffled frog-leaping algorithm (SFLA) has long been considered as new evolutionary algorithm of group evolution, and has a high computing performance and excellent ability for global search. Knapsack problem is a typical NP-complete problem. For the discrete search space, this paper presents the improved SFLA (ISFLA), and solves the knapsack problem by using the algorithm. Experimental results...

متن کامل

Genetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

متن کامل

Shuffled frog leaping algorithm based on enhanced learning

The paper proposes shuffled frog leaping algorithm (SFLA) based on enhanced learning, which generates a virtual general centre frog that is related to the optimal frog of each memeplex. The algorithm can utilise the superior information of each memeplex, enhance the mutual learning and use the average centre of optimal frog. In the processing of evolution, the optimal frog of sub-memeplex learn...

متن کامل

Centroid Mutation Embedded Shuffled Frog-Leaping Algorithm

Stochastic search algorithms that take their inspiration from nature are gaining a great attention of many researchers to solve high dimension and non – linear complex optimization problems for which traditional methods fails. Shuffled frog – leaping algorithm (SFLA) is recent addition to the family of stochastic search algorithms that take its inspiration from the foraging process of frogs. SF...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computational Intelligence Systems

سال: 2022

ISSN: ['1875-6883', '1875-6891']

DOI: https://doi.org/10.1007/s44196-022-00093-6